Image resampling between orthogonal and hexagonal lattices

نویسندگان

  • Dimitri Van De Ville
  • Rik Van de Walle
  • Wilfried Philips
  • Ignace Lemahieu
چکیده

Resampling techniques are commonly required in digital image processing systems. Many times the classical interpolation functions are used, i.e., nearest-neighbour interpolation and bilinear interpolation, which are prone to the introduction of undesirable artifacts due to aliasing such as moire patterns. This paper presents a novel approach which minimizes the loss of information, in a least-squares sense, while resampling between orthogonal and hexagonal lattices. Making use of an extension of 2D splines to hexagonal lattices, the proper reconstruction function is derived. Experimental results for a printing application demonstrate the feasibility of the proposed method and are compared against the classical techniques.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Least-squares spline resampling to a hexagonal lattice

Resampling is a common operation in digital image processing systems. The standard procedure involves the (conceptual) reconstruction of a continuous image succeeded by sampling on the new lattice sites. When the reconstruction is done by classical interpolation functions, results might be sub-optimal because the information loss is not minimized. In the particular case of subsampling (i.e., re...

متن کامل

Tri-directional gradient operators for hexagonal image processing

Image processing has traditionally involved the use of square operators on regular rectangular image lattices. For many years the concept of using hexagonal pixels for image capture has been investigated, and several advantages of such an approach have been highlighted. We present a design procedure for hexagonal gradient operators, developed within the finite element framework, for use on hexa...

متن کامل

Textures on Rank-1 Lattices

Storing textures on orthogonal tensor product lattices is predominant in computer graphics, although it is known that their sampling efficiency is not optimal. In two dimensions, the hexagonal lattice provides the maximum sampling efficiency. However, handling these lattices is difficult, because they are not able to tile an arbitrary rectangular region and have an irrational basis. By storing ...

متن کامل

Hexagonal Discrete Global Grid Systems for Geospatial Computing

Advanced geospatial applications often involve complex computing operations performed under sometimes severe resource constraints. These applications primarily rely on traditional raster and vector data structures based on square lattices. But there is a significant body of research that indicates that data structures based on hexagonal lattices may be a superior alternative for efficient repre...

متن کامل

Topology-preserving hexagonal thinning

Thinning is awell-known technique for producing skeleton-like shape features fromdigital binary objects in a topology-preserving way.Most of the existing thinning algorithms work on input images that are sampled on orthogonal grids; however, it is also possible to perform thinning on hexagonal grids (or triangular lattices). In this paper, we point out to the main similarities and differences b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002